A general multi-step matrix splitting iteration method for computing PageRank
نویسندگان
چکیده
Based on the general inner-outer (GIO) iteration method [5,34] and framework [6], we present a multi-step matrix splitting (GMMS) for computing PageRank, analyze its overall convergence property. Moreover, same idea can be used as preconditioning technique accelerating Krylov subspace methods, such GMRES method. Finally, several numerical examples are given to illustrate effectiveness of proposed algorithm.
منابع مشابه
An Inner-Outer Iteration for Computing PageRank
We present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is simple, can be easily implemented and parallelized, and requires minimal storage overhead. Our convergence analysis shows that the algorithm is effective for a crude inner tolerance and is not sensitive to the choice...
متن کاملAn Inner/Outer Stationary Iteration for Computing PageRank
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to a simple preconditioning technique. It is simple, can be easily implemented and parallelized, and requires minimal storage overhead. Convergence analysis shows that the algorithm is effective for a crude inner tolera...
متن کاملAn Adaptive Reordered Method for Computing PageRank
We propose an adaptive reorderedmethod to deal with the PageRank problem. It has been shown that one can reorder the hyperlink matrix of PageRank problem to calculate a reduced system and get the full PageRank vector through forward substitutions. This method can provide a speedup for calculating the PageRank vector.We observe that in the existing reorderedmethod, the cost of the recursively re...
متن کاملConvergence of the multistage variational iteration method for solving a general system of ordinary differential equations
In this paper, the multistage variational iteration method is implemented to solve a general form of the system of first-order differential equations. The convergence of the proposed method is given. To illustrate the proposed method, it is applied to a model for HIV infection of CD4+ T cells and the numerical results are compared with those of a recently proposed method.
متن کاملA fixed point iteration for computing the matrix logarithm
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical method calculates successive square roots. In this article, a new algorithm is presented that relies on the computation of successive matrix exponentials. Conver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2021
ISSN: ['2406-0933', '0354-5180']
DOI: https://doi.org/10.2298/fil2102679t